System and method for optimized encoding and transmission of a plurality of substantially similar video fragments

ABSTRACT

A system and method for stitching separately encoded MPEG video fragments, each representing a different rectangular area of the screen together into one single full-screen MPEG encoded video fragment.

CROSS-REFERENCE TO RELATED APPLICATIONS

This patent application is a continuation of U.S. patent application Ser. No. 13/455,836 filed Apr. 25, 2012, which claims the benefit of U.S. patent application Ser. No. 10/991,674, filed Nov. 18, 2004, issued as U.S. Pat. No. 8,170,096, which claims the benefit of U.S. Patent Application Ser. No. 60/523,035 filed Nov. 18, 2003, all of which are incorporated by reference herein in their entirety.

FIELD OF THE INVENTION

This invention is directed towards digital compressed video, and more particularly towards a method for merging separately encoded MPEG video segments into a single full-screen encoded MPEG video segment.

BACKGROUND

Current electronic distribution of television messages, such as commercials, from an originator or distributor to one or more television broadcast stations and/or cable television master control centers, does not easily allow for regional customization of such messages. The reason for this is that each different variant of a message has to be transmitted completely by itself, and independent from the other variants, from sender to receiver. Each extra variant will thus require proportionally extra bandwidth usage over the transmission channel. Sending fifty different variants will require fifty times as much bandwidth as sending one single variant. This added bandwidth consumption would be prohibitively costly and/or time consuming.

Regional customization of television messages would be desirable, for example, in the distribution of infomercials. An infomercial is a television commercial with the specific purpose of getting the viewer to pickup the phone and order the advertised product immediately. Typically, there are two types of infomercials: Long form messages (paid programming), having a length of (approx.) 30 minutes, and short form messages (direct response ads, aired in the space of normal commercials), having a length of 30-120 sec.

A typical infomercial (just like any other television commercial) is broadcast in many different geographic regions from many different (easily 50 or more) broadcast stations. To measure the effectiveness of the commercial in the different regions it would be advantageous to have a different call-in phone number in use for the commercial in each region. Typically, such phone numbers to be called by the viewer are overlaid over a small portion, typically the bottom, of the video for the entire duration (or large portions) of the commercial.

Regional customization of television messages would also be advantageous, for instance, in the case of a commercial for a brand or chain that has many stores throughout the country. Commercials for the brand could be regionalized by showing the address of the nearest store for that brand, by showing different promotions for different products for each region, by showing different prices for the same product in different regions, etc. Such region-specific customizations could be added to small portions of the video of the commercial, for example as (but not limited to) a text overlay.

The above examples have in common that, a small portion of the video is varying between the different versions of the message, while larger portions of the video are common between many versions. Therefore it would be advantageous if there was a method to independently encode and distribute different portions of the screen, to exploit the different amounts of variation for different portions of the screen, and thus achieve a saving in required transmission bandwidth. An additional advantage would be reduced encoding and decoding time since the amount of video to be encoded and decoded would be less.

However, television commercials are currently mainly distributed in MPEG-2 format. Unfortunately, the MPEG-2 video compression standard as well as existing MPEG-2 encoding and decoding equipment do not allow for independent encoding, decoding, and/or assembly into full screen video, of different portions of the video screen.

SUMMARY

“Video stitching” is a solution to the problem of how to efficiently encode, bundle, and assemble many different variants of a single piece of digital video, where certain (preferably small) rectangular parts of the screen can be identified as containing a lot of variations, and the remaining, preferably large, rectangular portion(s) of the screen are invariant (or have very little variation) across all versions of the video.

In a situation where only parts of the video, for instance the bottom, are different over all variants, it is advantageous to encode only one copy of the (common) top of the screen and 10 multiple different copies of the bottom of the screen than to encode each full-screen variant, At the receiving end, a video stitching system would be used to reconstruct any desired variant. Savings will be made both in speed of encoding, decoding, and size of the complete package with all variants.

An illustrative embodiment of the present invention includes a method of encoding partial-frame video segments, the method including dividing the full-video frame area into rectangular regions, wherein the rectangular regions have a length and width that are each a multiple of 16 pixels. Then upon obtaining video segments for at least one of the rectangular regions, the method includes determining a target VBV buffer size for the video segments for a selected rectangular region, and then encoding the video segments for the selected rectangular region using the determined target VBV buffer size. Preferably, a common GOP pattern is used for encoding all video segments for all of the rectangular regions.

The step of determining a target VBV buffer size includes selecting a target VBV buffer size that is substantially proportional to a full frame VBV buffer size based on relative size of the rectangular region as compared to a full frame size. Alternatively a target VBV buffer size is selected that is smaller than a value that is substantially proportional to a full frame VBV buffer size based on relative size of the rectangular region as compared to a full frame size. The method also includes determining a VBV bit rate for encoding the video segments for the selected rectangular region, wherein the VBV bit rate is selected that is substantially proportional to a full frame VBV bit rate based on relative size of the rectangular region as compared to a full frame size. Alternatively, a VBV bit rate is selected that is smaller than a value that is substantially proportional to a full frame VBV bit rate based on relative size of the rectangular region as compared to a full frame size.

The illustrative embodiment also includes determining f-code array values for the video segments, after encoding the video segments, modifying the f-code array values and motion vectors for the encoded video according to the determined f-code array values. The f-code array values are determined by using the maximum values for the f-code array values from the plurality of video segments.

The illustrative embodiment also includes assembling a row of encoded video segment macroblocks into a slice, wherein header information for each macroblock in the slice is modified for a proper format for a complete slice.

The method also includes obtaining a plurality of different video segments for the rectangular region, wherein the different video segments are then merged with other video segments for other rectangular regions to create multiple different full-video frame video segments.

The present invention also includes an encoding system for encoding partial-frame video segments to allow different partial-frame video segments to be merged into a full-video frame.

The savings in overall package size as provided by the present invention is important, for instance, in situations of satellite (multicast/broadcast) distribution of the entire package from the originator to the local broadcast stations. Each local station has to extract the desired variant from the package. This is shown in FIG. 2. Large savings in the size of the package to be distributed will make it commercially feasible to have many different variants of the infomercial.

Even in the case of (unicast) distribution of the entire package from a single originator to a single intermediate distribution point (such as a cable television local advertising master control center) the savings in bandwidth between originator and distribution point will allow for major cost and time savings.

It is important to note that Video Stitching as described in the present invention is very different from other object-based compressed video technologies (such as MPEG-4) since the order of decoding and composing (stitching) the individual segments is reversed. In MPEG-4, the video decoder first decodes the various encoded video segments, and then composes the resulting uncompressed segments (typically on-the-fly) into full screen video. In the proposed video stitching method, the compressed segments are first stitched together into a full-screen compressed segment which is subsequently decoded.

Another difference between the present invention and other object-based video compression methods such as MPEG-4 is that Video Stitching as described integrates naturally with existing MPEG-2 decoding equipment deployed in, for example, cable television headends and broadcast television stations. To support video stitching in such environments would mean that the individually encoded MPEG video segments are stitched together just after reception at the point of decoding. Decoding itself will not change since the Video Stitcher will produce the same type of (MPEG-2) streams that are currently handled by such systems. As a comparison, using MPEG-4 would mean that a transcoder from MPEG-4 to MPEG-2 is needed at the point of reception to be able to reuse the existing MPEG-2 decoders, which is disadvantageous. Another option would be replacing the existing MPEG-2 decoders with MPEG-4 decoders which is disadvantageous from a cost perspective.

Note that the present invention will work with videos of any resolution, and is not restricted to just NTSC or PAL. Any resolution that is legal under MPEG is supported.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other features and advantages of the present invention will be more fully understood from the following detailed description of illustrative embodiments, taken in conjunction with the accompanying drawings in which:

FIG. 1 illustrates a video segment split-up in a top and bottom region;

FIG. 2 illustrates a satellite broadcast of a package consisting of a single top video file and multiple bottom video files;

FIG. 3 illustrates a video segment split-up into five different rectangular regions;

FIG. 4 illustrates a video segment split-up into seven different rectangular regions;

FIG. 5 illustrates part of preparing stitchable video segments and stitching them together into valid MPEG, according to an illustrative embodiment; and

FIG. 6 illustrates another part of preparing stitchable video segments and stitching them together into valid MPEG according to an illustrative embodiment.

DETAILED DESCRIPTION

A method of creating personalized messages that can be used for regionally, or even personalized, targeting based on variations in the commercial is described in co-pending U.S. patent application Ser. No. 09/545,015 filed on Apr. 7, 2000 and incorporated herein by reference. The present invention is directed towards variations between video and commercials based on differences that are confined to certain portions of the screen.

The present invention finds utility in various data transmission applications including, but not limited to, encoding, transmission, reception and decoding of digital compressed video, regardless of the means of transmission.

An application of an illustrative embodiment is shown in FIG. 1. A piece of video 20 is to be created of which fifty variations must be made, each with a different 1-800-number, promotion code, or any other piece of information in the bottom ⅓^(rd) of the screen. The final videos have to be encoded in MPEG-2, have a total resolution of 720×480 (NTSC) and a bitrate of 4,500,000 bps. The top video will have a resolution of 720×320 and an encoding bitrate of 3,000,000 bps. The bottom video will have a resolution of 720×160 and an encoding bitrate of 1,500,000 bps, leading to the desired merged resolution and bitrate. Typical MPEG VBV buffer size values will be 140 Kbyte for the top and 70 Kbyte for the bottom (leading to a an overall VBV buffer size after merging below the maximum of 224 Kbyte).

Now, assuming a thirty minute message, fifty completely encoded variants would require a total storage capacity (and transmission bandwidth) of (30×60×4.5×50)/(8×1024)=50 Gbyte, Separate encoding of the single top section and the 50 different bottom sections will only require (30×60×(3+1.5×50))/(8×1024)=17 Gbyte, which represents a reduction in size of a factor 3 (34% of the full size).

In situations where the bottom section is smaller and/or the amount of different variants is larger the savings will increase even more dramatically. For example, a bottom section of ⅕^(th) of the screen size and a total of 100 variants will lead to a size of 100 Gbyte for encoding of each full variants, and 30×60×4.5×(⅘+⅕×100)/(8×1024)=20.5 Gbyte for separate encoding of the top part and the bottom parts. This reflects a reduction by a factor of 5 (20% of the fall size).

FIGS. 5 and 6 describe the various steps in preparing stitchable video segments, and stitching such video segments together into full-screen segments. Throughout the following text references will be made to the steps shown in these pictures as further illustration of the present invention.

A first aspect of the present invention is how to encode the video to make it suitable for stitching at a later point in time. One possibility is to encode all variant commercials in their full-screen entirety, and then post-process them into the separate parts. This has proven to be not practical because MPEG motion vectors allow video at any given point on the screen to “migrate” to other parts of the screen over time (the duration of a GOP (Group of Pictures) is typically half a second), and it cannot easily he guaranteed that changes in the variable part of the screen won't end up in the invariant part, causing a visible video glitch.

A workable solution according to the present invention is to encode the separate rectangular parts (2 or more) of the video fully independent from each other. Each part would represent a rectangular region of the screen. Each such region is a multiple of 16 pixels high and a multiple of 16 pixels wide and thus correspond to an integral number of MPEG macroblocks. All rectangular regions together would precisely cover the entire screen 20 (without overlaps). An NTSC picture, for example, is 720 pixels wide and 480 pixels high, corresponding to 45 macroblocks wide and 30 macroblocks high. One can, for instance, encode the top 25 rows as the invariant part of the picture and make multiple versions of the bottom 5 rows to be stitched together with the top 25.

More complicated situations are shown in FIGS. 3 and 4, where the screen is split-up into five and seven rectangular regions respectively, each an exact multiple of 16 pixels wide and high. In FIG. 3 there is one region 22 of the screen variable (with a call to action). In FIG. 4 there is an additional logo 24 on the top right hand corner that is variable.

By running the rectangular regions of the picture through an encoder separately, the present invention guarantees that motion vector “crosstalk” between the different segments will not occur.

FIG. 5 shows the steps according to an illustrative embodiment. At step 1, is the step of determining on the different screen regions, as previously described. For this example, there are five different regions. At step 2, the video for each region is created or extracted from source material of other dimensions, as is well known in the art. If the source material is already of the right dimensions, it can be encoded directly. All the segments (including variations) are then encoded, and then packaged for delivery, step 3. The packaging may include all segments, or be divided up by delivery area or other parameters. The package is then transferred to the receiving station by any type of transmission, step 4. The receiving station can be a head end, set top box, or other place where the segments will be assembled. The proper segments are selected, and assembled, or stitched, into the appropriate full screen size, step 5. Details for this process are provided below.

Enabling efficient stitching of separately-encoded pieces of video according to the illustrative embodiment utilizes several steps during encoding, step 2 FIG. 5. A first requirement on the separately encoded videos is that they must maintain exactly identical GOP patterns. For instance, an IPBBPBBPBBPBB segment can't be stitched together with an IPBPBPBPBPBPB segment. Even though the number of frames is the same in these GOPs, the differing patterns preclude stitching because a resultant frame can't think of itself as part P (Interframe or forward prediction frame) and part B (bi-directional predicted frame) at the same time. Stitching such videos together would effectively mean decoding and subsequently reencoding the video at the point of reception, thus defeating the purpose.

When encoding the rectangular regions according to the illustrative embodiment, it is beneficial for VBV buffer size and bitrate for each region to be chosen in approximate proportion to the relative sizes of the regions. For example, in a two region situation, as shown in FIG. 1, if one region takes 90% of the area, it should use about 90% of the intended final VBV buffer size, while the other region should get 10% or so of each. It is furthermore important to note, as will be explained below, that stitching will typically result in some data expansion, so the VBV sizes and bitrates actually chosen for encoding should be slightly smaller than the ones that are computed based only on the proportion of the relative region sizes, applied to the fixed desired VBV buffer size and bitrate. In practice, this means a slight reduction by a fixed factor, usually between 10% and 15%, for each segment. For example, for a VBV buffer size of 224 Kbyte and a bitrate of 6000000 bits/sec, the sum of the two parts should be about 200 Kbyte for the VBV buffer and about 5400000 bits/sec, for the bitrate.

Another typical requirement for encoding “stitchable” video segments according to the illustrative embodiment is that the global stream parameters that control macroblock decoding should be identical across clips. In particular, the optional quantization matrices included in sequence headers should be the same, as well as any quantization matrix extensions present. Several fields of the picture coding extension should also agree across clips, most importantly, the alternate_scan bit, the intra_dc_precision value, and the f_code 4-value array. Most encoders presently used in the industry usually either pick fixed values for these fields, or they can be instructed to use certain fixed values. The exception to this is the 4-value f_code array which governs the decoding of motion vectors.

The f_code array contains four elements: one each for forward horizontal motion, forward vertical motion, backward horizontal motion, and backward vertical motion. Only B frames actually use all four. P frames only use the forward components. I frames (Intraframes) don't use them at all.

The values in the f code array reflect the “worst case” motion vectors found in the associated image. A picture with a lot of large-scale gross motion in it relative to its predecessor picture tends to have larger maximum motion vector sizes than a relatively static picture. Bigger motion vectors are reflected in bigger f_code values, which basically control the number of bits used to express motion vectors in the picture. In order to perform video stitching, the f_code values of the video frames that must be stitched together must be modified so that they are consistent. Subsequently, according to the illustrative embodiment, the motion vectors that are expressed in terms of these f_codes reencoded to match the new f_codes. An advantage is that any given motion vector can he re-encoded for a larger f_code value, but not necessarily for a smaller f_code value. Therefore, to be able to stitch two or more video frames together, the illustrative embodiment defines the f_code values for the stitched frame to be at least the maximum of the alternatives for any f_code array component. After thus determining the new f code for the stitched frame, the motion vectors of each frame are reencoded in terms of the new f_codes. This reencoding always typically involves some data expansion, but practice has shown it is often in the order of just 1%.

According to the illustrative embodiment, there are two options to modifying f_code values and reencoding motion vectors to make video fragments stitchable. The first option is to make this part of the actual stitching process, i.e., in the local stations or set top boxes as shown in FIG. 2. The advantage of this approach is that the package that has to be transmitted as small as possible, leading to a saving in bandwidth. However, this means that the stitching work in the local station is more complex, since all the f_code modification and motion-vector reencoding has to be done locally.

The second option is to find the maximum f_code values for a given frame across all variants and modify all the variants (i.e., reencode the motion vectors) for this maximum f_code array before packaging for distribution. This will simplify the stitching process in the local station at the expense of needing more bandwidth, and leading to slightly larger (1% or so) stitched videos (since the max. f_code is computed across all variants, and not on a per variant basis).

FIG. 5 illustrates the first option, i.e., packaging the video directly after encoding, and modifying f_codes and motion vectors after distribution. Step 3 illustrates the packaging of the separately encoded segments into a single package. Step 4 illustrates the distribution of that package (using any available transmission mechanism). Step 5 shows the selection, at the reception point, of a set of segments (one for each region) to be stitched together. Step 6 in FIG. 6 illustrates the modification off code arrays and motion vectors at the point of reception.

The actual stitching process, after having modified all the f_code arrays and having reencoded all the motion vectors for all the (slices of the) frames of the videos to be stitched together, is now described.

In MPEG, a single row of macroblocks is encoded as a sequence of one or more MPEG “slices”, where a slice is a row of macroblocks (one macroblock high, and one or more macroblocks wide). In a single MPEG video frame, these slices are encoded from top to bottom.

The first task to compose a full-screen frame from multiple separately encoded smaller frames is to produce the screen-wide rows of macroblocks. Simply appending the slices from the different encoded frames for each such row in a left to right order is already sufficient. The only extra work that has to be done for each slice is setting the macroblock address increment value in the first macroblock to indicate the horizontal starting position of the slice in the macroblock row.

Having composed all the individual screen-wide macroblock rows, the next step is composing these rows into a full frame. This can be done by appending the rows in a top to bottom order. The only extra work that has to be done is adjusting the slice slice_vertical_position value in each slice to indicate how far down the screen from the top the slice goes in the final stitched frame.

It is important to consider that, although it is perfectly legal MPEG to have multiple slices per screen-wide row of macroblocks, some decoders have problems with more than 1 slice per macroblock row since this is not common practice in the industry. It is safer to concatenate two or more slices into a single full-width slice. Slice-concatenation according to the illustrative embodiment is described by the following 6 step process.

1. All but the first of the slices being concatenated must have their slice header removed.

2. The first macroblock of a slice to be appended to a previous slice may need a macroblock_address_increment adjustment to indicate how many macroblocks have been skipped between the end of the slice to its left and the current macroblock. When there is no gap (as is usually the case), this value will need no change.

3. If there is a difference between the quantiser_scale_code in use at the end of a slice and that declared in the excised slice header on the following slice, the first macroblock of that following slice will need to contain the correct quantiser_scale_code, indicated by setting the macroblock_quant_flag in the macroblock, followed by the appropriate quantiser_scale_code.

4. The predicted motion vectors at the beginning of a slice following a previous slice must be updated. At the beginning of a slice, motion vectors are predicted to be zero, and so the first motion vectors encoded for a macroblock represent absolute values. But subsequent macroblocks derive their motion vectors as deltas from those of the macroblock to their immediate left. Forward and reverse motion vectors are tracked separately, and in the event that macroblocks are skipped within the slice, predictions may revert to zero. The exact rules about how skipped macroblocks affect predictions differ between P and B frames and field and frame pictures. In any event, one or more macroblocks at or near the beginning of a slice to be appended to a previous slice most likely need to be modified to take into account motion vector predictions inherited from the previous slice. Once inherited correctly, macroblocks farther to the right need not be modified.

5. The “dct_dc_differential” values found in the first macroblock of an appended slice must be modified to reflect inheritance of predicted dc levels front the last macroblock of the slice onto which the appending operation is being performed. Normally slices start out with known fixed dc level assumptions in the first macroblock, and inherit dc levels, with modification by dct_dc_differential values, from left to right. Modification of the dct_dc_differential value is required at the start of an appended slice because it must base its dc calculation on inheritance from the macroblock to its left instead of being based on initial fixed values.

6. The stop code for a slice is a run of 23 zero bits. These stop bits have to be removed for all but the last appended slice on a screen row of macroblocks,

FIG. 6 illustrates the stitching of video segments and merging of slices. Step 7 illustrates the concatenation of slices for single rows of macroblocks as well as concatenation of such rows into a full-screen picture. Step 8 illustrates the subsequent merging of multiple slices for one screen-wide macroblock row into a single slice.

The final data fields that have to be determined for a complete frame that has thus been stitched together are the vertical_size_value, bit_rate_value, and vbv_buffer_size_value, all in the MPEG sequence header, as well as the vbv_delay field in the MPEG picture header.

The value for vertical_size_value is simply the height of the stitched frame and is hence easy to modify. However, in the case of CBR (Constant BitRate) MPEG video, to obtain legal values for bit_rate_value, vbv_buffer_size_value, and vbv_delay requires additional work. It is generally necessary to add varying amounts of padding between frames of video while appending all frames together, in order to ensure that the video has constant bitrate and satisfies the rules for the CBR video buffer verification (VBV) model that govern the legal playability of MPEG video. Only after this padding is complete, the values for bit_rate_value, vbv_buffer_size_value, and vbv_delay can be filled in for each frame, step 9. This will be described further in the separate section below.

In the case of VBR (Variable BitRate) MPEG video, padding is not strictly necessary. Instead, the system can recalculate the peak (maximum) bitrate of the stream (which might have changed due to the f_code and motion vector adaptation), and fill in this value in the bit_rate_value fields of the video. The vbv_delay fields have a constant, fixed, value in the case of VBR video, and the value for vbv_buffer_size can simple be chosen as the maximum allowed VBV buffer size for the particular profile and level of the MPEG video (e.g., 224 Kbyte for Main Profile/Main Level MPEG video)

As mentioned previously, macroblock data tends to slightly expand to reflect the necessary f_code value changes during stitching, causing an increase in required bandwidth. Conversely, when streams are stitched together, sequence, GOP, and picture header information from all but one of them is stripped off to leave just the slices of macroblocks, causing a slight decrease in required bandwidth.

The net effect of f_code-related expansion and header-stripping contraction usually ends up with a net expansion of raw data to be transmitted. This data expansion will be unevenly distributed, since some frames in the stream will be expanded more than others. Therefore, in order to maintain, constant bitrate (CBR) and satisfy the associated VBV buffer models, the new video data must be properly distributed, and this can be achieved by adding padding bytes between frames of video.

The most straightforward way to pad for VBV legality and constant bitrate is to measure the size of each original frame of video and the stitched frame produced by their concatenation with f_code adjustment as follows.

-   Let S(n,f) be the size in bytes of frame f of video segment n, where     there are N segments (0, . . . , N−1) that are being stitched     together and F frames of video (0, . . . , F) in each segment. -   S(f) be the size in bytes of frame f of stitched-together video     (after f_code motion vector adjustment and the discarding of headers     from all but one of the stitched frames)     Then     E(f)=S9f)/(S(0,f)+S91,f)+ . . . +S(N−1,f))     is the expansion ratio of frame f of stitched video. Now, let Emax     be the maximum of all values E(0), . . . E(F−1), i.e., the maximum     expansion ratio across all F frames. Practice has shown that a     typical value is around 1.1 (a 10% expansion). By padding all     stitched frames (except the one(s) that have this maximum expansion     rate) with an appropriate number of zero-bytes it is possible to     make E(f) the same as this maximum value Emax for each video frame.     Now, furthermore assuming that the initial frame VBV delay times     were equal in the original separately encoded clips (which is easy     to accomplish with existing encoders) we can define:     VBVmax=(VBV(0)+VBV(1)+ . . . +VBV(N))*Emax     where

VBV(n) is the VBV buffer size used to encode segment n, and

VBVmax is the VBV buffer size in which the stitched video is guaranteed to run

Padding to a maximum expansion rate as just described is a simple way of guaranteeing a certain VBV buffer size for the resultant video. Keeping VBVmax below the MPEG defined max. VBV buffer size (e.g., 224 Kbyte for MPEG-2 Main Profile/Main Level, or MP@ML) will guarantee legal video that any decoder will be able to decode.

One issue with the just described simple padding algorithm is that it can result in significant (10% or so) expansion of the final stitched video, which can be wasteful. In case the expansion is already done before transmission it will also lead to extra bandwidth consumption.

However, a person skilled in the art can see that it is possible to construct more intelligent variations of this worst-case padding algorithm which reduce the wasted bandwidth and VBV buffer growth by removing or relocating sections of padding in such a way that buffer models are not violated.

After the padding of each frame is complete, the values for bit_rate_value, vbv_buffer_size_value, and vbv_delay can finally be computed and filled in the sequence and picture headers for each frame, thus solving the last required action to complete the stitching process.

Step 9 in FIG. 6 illustrates the final step of padding between frames to achieve the final VBV buffer size for the stitched video sequence in the case of CBR video.

Although the invention has been shown and described with respect to illustrative embodiments thereof, various other changes, omissions and additions in the form and detail thereof may be made therein without departing from the spirit and scope of the invention.

It will be understood that various modifications may be made to the embodiments disclosed herein. Therefore, the above description should not be construed as limiting, but merely as exemplification of the various embodiments. Those skilled in the art will envision other modifications within the scope and spirit of the claims appended hereto. 

What is claimed is:
 1. A method comprising: dividing a full-video frame area into a plurality of non-overlapping regions; receiving a plurality of partial-frame video segments corresponding to a selected region of the plurality of non-overlapping regions; determining a target video buffer verification buffer size for the plurality of partial-frame video segments for the selected region; and encoding each of the plurality of partial-frame video segments for the selected region using the determined target video buffer verification buffer size to generate a plurality of encoded partial-frame video segments such that an encoded partial-frame video segment of the plurality of encoded partial-frame video segments is capable of being seamlessly stitched into the selected region of the full-video frame area prior to decoding.
 2. The method of claim 1, wherein the encoding uses a common GOP pattern for each of the plurality of partial-frame video segments.
 3. The method of claim 1, wherein the target video buffer verification buffer size for the plurality of partial-frame video segments for the selected region is proportional to a full frame video buffer verification buffer size based on a size of the selected region as compared to a full frame size.
 4. The method of claim 1, further comprising: determining a video buffer verification bit rate for encoding the plurality of partial-frame video segments for the selected region, wherein the video buffer verification bit rate is proportional to a full frame video buffer verification bit rate based on a size of the selected region as compared to a full frame size.
 5. The method of claim 1, further comprising: determining f-code array values for the plurality of partial-frame video segments; and modifying, after encoding the plurality of partial-frame video segments, the f-code array values and motion vectors for the encoded plurality of partial-frame video segments according to the determined f-code array values.
 6. The method of claim 1, further comprising: assembling a row of encoded video segment macroblocks into a slice, wherein header information for each macroblock in the slice is modified for a proper format for a complete slice.
 7. The method of claim 1, further comprising: sending the encoded partial-frame video segments to a video display device, wherein the partial-frame video segments are merged with other partial-frame video segments for other regions to create multiple different full-video frame video segments.
 8. An apparatus comprising: one or more processors; and a memory storing computer executable instructions that, when executed by the one or more processors, cause the apparatus to: divide a full-video frame area into a plurality of non-overlapping regions; receive a plurality of partial-frame video segments corresponding to a selected region of the plurality of non-overlapping regions; determine a target video buffer verification buffer size for the plurality of partial-frame video segments for the selected region; and encode each of the plurality of partial-frame video segments for the selected region using the determined target video buffer verification buffer size to generate a plurality of encoded partial-frame video segments such that an encoded partial-frame video segment of the plurality of encoded partial-frame video segments is capable of being seamlessly stitched into the selected region of the full-video frame area prior to decoding.
 9. The apparatus of claim 8, wherein the regions are rectangular.
 10. The apparatus of claim 8, wherein the encoding uses a common GOP pattern for each of the plurality of partial-frame video segments.
 11. The apparatus of claim 8, wherein the target video buffer verification buffer size for the plurality of partial-frame video segments for the selected region is proportional to a full frame video buffer verification buffer size based on a size of the selected region as compared to a full frame size.
 12. The apparatus of claim 8, the executable instructions that, when executed by the one or more processors, further cause the apparatus to: determine a video buffer verification bit rate for encoding the plurality of partial-frame video segments for the selected region, wherein the video buffer verification bit rate is proportional to a full frame video buffer verification bit rate based on a size of the selected region as compared to a full frame size.
 13. The apparatus of claim 8, the executable instructions that, when executed by the one or more processors, further cause the apparatus to: assemble a row of encoded video segment macroblocks into a slice, wherein header information for each macroblock in the slice is modified for a proper format for a complete slice.
 14. The apparatus of claim 8, the executable instructions that, when executed by the one or more processors, further cause the apparatus to: send the encoded partial-frame video segments to a video display device, wherein the partial-frame video segments are merged with other partial-frame video segments for other regions to create multiple different full-video frame video segments.
 15. A non-transitory computer-readable storage medium containing computer-readable program code that, when executed by a computer, cause the computer to: divide a full-video frame area into a plurality of non-overlapping regions; receive a plurality of partial-frame video segments corresponding to a selected region of the plurality of regions; determine a target video buffer verification buffer size for the plurality of partial-frame video segments for the selected region; and encode each of the plurality of partial-frame video segments for the selected region using the determined target video buffer verification buffer size to generate a plurality of encoded partial-frame video segments such that an encoded partial-frame video segment of the plurality of encoded partial-frame video segments is capable of being seamlessly stitched into the selected region of the full-video frame area prior to decoding.
 16. The non-transitory computer-readable storage medium of claim 15, wherein the target video buffer verification buffer size for the plurality of partial-frame video segments for the selected region is substantially proportional to a full frame video buffer verification buffer size based on relative size of the selected region as compared to a full frame size.
 17. The non-transitory computer-readable storage medium of claim 15, wherein each of the one or more regions is associated with a display area of a video display device.
 18. The non-transitory computer-readable storage medium of claim 15, wherein each of the one or more regions comprise a length that is a multiple of sixteen pixels and a width that is a multiple of sixteen pixels.
 19. The non-transitory computer-readable storage medium of claim 15, wherein the encoding uses a common GOP pattern for each of the plurality of partial-frame video segments.
 20. The non-transitory computer-readable storage medium of claim 15, the computer-readable program code that, when executed by the computer, further cause the computer to: determine a video buffer verification bit rate for encoding the plurality of partial-frame video segments for the selected region, wherein the video buffer verification bit rate is proportional to a full frame video buffer verification bit rate based on a size of the selected region as compared to a full frame size. 